Package edu.claflin.finder.algo.clustering

Class FastGreedy

java.lang.Object

edu.claflin.finder.algo.Algorithm

edu.claflin.finder.algo.clustering.ClusteringAlgorithm

edu.claflin.finder.algo.clustering.FastGreedy

All Implemented Interfaces:

Processable<Graph,Graph>

public class FastGreedy
extends ClusteringAlgorithm

FastGreedy Algorithm for Community Detection. Based on python's igraph library.

Author:

Cesar Martin

See Also:

• Original Paper
• For Weighted Networks
• Original igraph implementation

Nested Class Summary

Nested classes/interfaces inherited from class edu.claflin.finder.algo.Algorithm

Algorithm.GraphSortOrder

Field Summary

Fields inherited from class edu.claflin.finder.algo.Algorithm

args, PROP_PROGRESS

Constructor Summary

Constructors

Constructor	Description
FastGreedy(ArgumentsBundle args)

Method Summary

Modifier and Type	Method	Description
ArrayList<Graph>	process(Graph graph)	Performs FastGreedy community detection on a given Graph, returning the clustering with the maximum modularity.
String	toString()

Methods inherited from class edu.claflin.finder.algo.clustering.ClusteringAlgorithm

buildCommunityGraphs, isWeighted

Methods inherited from class edu.claflin.finder.algo.Algorithm

addPropertyChangeListener, cull, getGraphSortOrder, getMinNodeCount, getPartiteNumber, getWeightName, removePropertyChangeListener, setGraphSortOrder, setMinNodeCount, setPartiteNumber, setProgress, setWeightName, zeropad

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Details

FastGreedy

public FastGreedy(ArgumentsBundle args)

Method Details

toString

public String toString()

Overrides:

toString in class Object

process

public ArrayList<Graph> process(Graph graph)

Performs FastGreedy community detection on a given Graph, returning the clustering with the maximum modularity.

Parameters:

graph - the Graph to perform FastGreedy on

Returns:

the list of Graphs representing the clustering with the maximum modularity